Computing with graph rewriting systems with priorities
نویسندگان
چکیده
منابع مشابه
Term Rewriting Systems with Priorities
Term rewriting systems with rules of different priority are introduced. The semantics are exp}ained in detail and several examples are discussed. Note: Partial support received from the European Communities under Esprit contract no. 432, Meteor (An integrated formal approach to industrial software development).
متن کاملTerm-Rewriting Systems with Rule Priorities
In this paper we discuss term-rewriting systems with ru/e prioriries, which simply is a partial ordering on the rules. The procedural meaning of such an ordering then is, that the application of a rule of lower priority is allowed only if no rule of higher priority is applicable. The semantics of such a system is discussed. It turns out that the class of all hounded systems indeed has such a se...
متن کاملVisual Programming with Graph Rewriting Systems
The multi-paradigm language PROGRES is the first rule-oriented visual language which has a well-defined type concept and supports programming with graph rewriting systems. To some extent, it has the flavor of a visual database programming language with powerful pattern matching and replacing facilities as well as backtracking capabilities. Until now, it was mainly used for specifying and rapid ...
متن کاملGeneric modelling with graph rewriting systems
One of the main goals of the software engineering discipline is the provision of appropriate tools for the construction of complex and interactive software systems. A large number of tools, languages, and methods exist to cope with the problems of administering the documents, information, and processes of creating large software systems. Specification languages and methods have been developed t...
متن کاملOperational Semantics of Rewriting with Priorities
We study the semantics of term rewriting systems with rule priorities (PRS), as introduced in [1]. Three open problems posed in that paper are solved, by giving counter examples. Moreover, a class of executable PRSs is identi ed. A translation of PRSs into transition system speci cations (TSS) is given. This translation introduces negative premises. We prove that the translation preserves the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90116-b